On Modal µ -Calculus and Gödel-Löb Logic
نویسندگان
چکیده
We show that the modal μ-calculus over GL collapses to the modal fragment by showing that the fixpoint formula is reached after two iterations and answer to a question posed by van Benthem in [vBe06]. Further, we introduce the modal μ∼-calculus by allowing fixpoint constructors for any formula where the fixpoint variable appears guarded but not necessarily positive and show that this calculus over GL collapses to the modal fragment, too. The latter result allows us a new proof of the de Jongh, Sambin Theorem and provides a simple algorithm to construct the fixpoint formula.
منابع مشابه
Constructive Provability Logic 1
We present two variants of an intuitionistic sequent calculus that validates the Löb rule and permits logical reflection over provability. We explore properties of both variants of this logic, which we call constructive provability logic due to its close ties to Gödel-Löb provability logic.
متن کاملSequent logic of arithmetic decidability∗
Our paper continues, on the one hand, the study of modal logics that have arithmetical semantics, and on the other, the investigation of decidability (or “non-contingency”) logics. We present Hilbert-style axiomatic system for the non-contingency logic of the Gödel-Löb provability logic GL, in other words, for the logic that is complete under the interpretation of a formula BA as ‘a sentence A ...
متن کاملConstructive Provability Logic
We present constructive provability logic, an intuitionstic modal logic that validates the Löb rule of Gödel and Löb’s provability logic by permitting logical reflection over provability. Two distinct variants of this logic, CPL and CPL*, are presented in natural deduction and sequent calculus forms which are then shown to be equivalent. In addition, we discuss the use of constructive provabili...
متن کاملFree Algebras for Gödel-Löb Provability Logic
We give a construction of finitely generated free algebras for Gödel-Löb provability logic, GL. On the semantic side, this construction yields a notion of canonical graded model for GL and a syntactic definition of those normal forms which are consistent with GL. Our two main techniques are incremental constructions of free algebras and finite duality for partial modal algebras. In order to app...
متن کاملProject Report Logic Programming in Constructive Provability Logic 15-816 Modal Logic
We present a novel formulation of CPL, a constructive logic of provability that is closely connected to the Gödel-Löb logic of provability. Our logical formulation allows modal operators to talk about both provability and non-provability of propositions at reachable worlds. We use this logic as a basis for a discussion of negation in logic programming.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 91 شماره
صفحات -
تاریخ انتشار 2009